Optimal Synthesis of Network with Weighted Constraints for Multiple Sources and Sinks
نویسندگان
چکیده
منابع مشابه
Optimal flows in networks with multiple sources and sinks
In their famous book, Ford and Fulkerson [ 3 ] state that the situation in which there are multiple sources and sinks, with flow permitted from any source to any sink, presents nothing new. They claim that a multiple source, multiple sink network reduces to a single source, single sink network by the adjunction of a supersource, a supersink, and several arcs. That is of course true if only a ma...
متن کاملSingle-Commodity Stochastic Network Design with Multiple Sources and Sinks
This paper examines the single-commodity stochastic network design problem with multiple sources and sinks. We characterize the structures of the optimal designs and compare with the deterministic counterparts. We do this primarily to understand what constitutes good robust network designs, but hope that the understanding can also be used to develop better heuristic algorithms than those availa...
متن کاملMulticasting Correlated Multiple Sources to Multiple Sinks over a Network
The problem of network coding for multicasting a single source to multiple sinks has first been studied by Ahlswede, Cai, Li and Yeung in 2000, in which they have established the celebrated max-flow mini-cut theorem on non-physical information flow over a network of independent channels. On the other hand, in 1980, Han has studied the case with correlated multiple sources and a single sink from...
متن کاملWeighted Optimal Path in Graph with Multiple Indexes
This paper represents a technique for finding optimal paths with multiple indexes in a graph. Up to the present time, all optimal paths have been determined upon one index, say, distance for which an evaluation method exists. In this paper firstly we define multiple indexes for each edge in such a way that anyone can treat the factor for assigning an optimal path. Here, we use Data Envelopment ...
متن کاملTransport in networks with multiple sources and sinks
We investigate the electrical current and flow (number of parallel paths) between two sets of n sources and n sinks in complex networks. We derive analytical formulas for the average current and flow as a function of n. We show that for small n, increasing n improves the total transport in the network, while for large n bottlenecks begin to form. For the case of flow, this leads to an optimal n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Society of Instrument and Control Engineers
سال: 1982
ISSN: 0453-4654
DOI: 10.9746/sicetr1965.18.450